Specifying and Verifying Event-Based Fairness Enhanced Systems
نویسندگان
چکیده
Liveness/Fairness plays an important role in software specification, verification and development. Existing event-based compositional models are safety-centric. In this paper, we describe a framework for systematically specifying and verifying event-based systems under fairness assumptions. We introduce different event annotations to associate fairness constraints with individual events. Fairness annotated events can be used to embed liveness/fairness assumptions in event-based models flexibly and naturally. We show that state-of-the-art verification algorithms can be extended to verify models under fairness assumptions, with little computational overhead. We further improve the algorithm by other model checking techniques like partial order reduction. A toolset named PAT has been developed to verify fairness enhanced event-based systems. Experiments show that PAT handles large systems with multiple fairness assumptions.
منابع مشابه
Specifying & Verifying Concurrent Systems Using Z
At present, few guidelines exist for applying the Z notation to concurrent systems, while existing approaches to proving properties of Z speciications of concurrent systems place emphasis on the use of additional formalisms such as temporal logic. This paper proposes a practical and rigorous approach to specifying and verifying concurrent systems using the Z notation alone. Guidelines are given...
متن کاملin ri a - 00 00 12 62 , v er si on 1 - 2 1 A pr 2 00 6 Event Systems and Access Control ⋆
We consider the interpretations of notions of access control (permissions , interdictions, obligations, and user rights) as run-time properties of information systems specified as event systems with fairness. We give proof rules for verifying that an access control policy is enforced in a system, and consider preservation of access control by refinement of event systems. In particular, refineme...
متن کاملEvent Systems and Access Control
We consider the interpretations of notions of access control (permissions, interdictions, obligations, and user rights) as run-time properties of information systems specified as event systems with fairness. We give proof rules for verifying that an access control policy is enforced in a system, and consider preservation of access control by refinement of event systems. In particular, refinemen...
متن کاملThe relationship between CSP, FDR and Büchi automata
Two long standing approaches to specifying and verifying properties of finite-state systems are Büchi automata, which are specialised for reasoning about infinite traces, and the combination of CSP and its refinement checker FDR, which offer some scope for reasoning about infinite traces in addition to capturing a wide variety of finitely observable behaviour. In this paper we demonstrate that ...
متن کاملAn Event Algebra Based System for Verifying E-Commerce Transactions
This paper describes extensions to a Behavioural Description Language (BDL), which was originally proposed to characterize concurrent behaviour of simple objects and a group of objects. One of the novelties of this paper is its application to the field of E-Commerce transaction systems. Based on the BDL, we propose new concepts, namely, transaction patterns and transaction architectures, which ...
متن کامل